Statistical Zero Knowledge and quantum one-way functions
نویسندگان
چکیده
منابع مشابه
Statistical Zero Knowledge and quantum one-way functions
One-way functions are a very important notion in the field of classical cryptography. Most examples of such functions, including factoring, discrete log or the RSA function, can be, however, inverted with the help of a quantum computer. In this paper, we study one-way functions that are hard to invert even by a quantum adversary and describe a set of problems which are good such candidates. The...
متن کاملStatistical Concurrent Non-malleable Zero-Knowledge from One-Way Functions
Concurrent non-malleable zero-knowledge (CNMZK) protocols are zero-knowledge protocols that are secure even against adversaries that interact with multiple provers and verifiers simultaneously. Recently, the first statistical CNMZK argument forNP was constructed under the DDH assumption (Orlandi el al., TCC’14). In this paper, we construct a statistical CNMZK argument forNP assuming only the ex...
متن کاملOne-Way Functions, Hard on Average Problems, and Statistical Zero-Knowledge Proofs
In this paper, we study connections among one-way functions, hard on the average problems, and statistical zero-knowledge proofs. In particular, we show how these three notions are related and how the third notion can be better characterized, assuming the rst one.
متن کاملQuantum statistical zero-knowledge
In this paper we propose a definition for (honest verifier) quantum statistical zero-knowledge interactive proof systems and study the resulting complexity class, which we denote QSZK. We prove several facts regarding this class: • The following natural problem is a complete promise problem for QSZK: given instructions for preparing two mixed quantum states, are the states close together or far...
متن کاملOne-Way Functions are Essential for Non-Trivial Zero-Knowledge
It was known that if one-way functions exist, then there are zero-knowledge proofs for every language in PSPACE . We prove that unless very weak one-way functions exist, ZeroKnowledge proofs can be given only for languages in BPP. For average-case definitions of BPP we prove an analogue result under the assumption that uniform one-way functions do not exist. ∗ University of California at Berkel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2007
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2007.03.013